From symbolic constraint automata to Promela

In this paper, we study a subclass of constraint automata with local variables. The fragment denotes an executable subset for which synchronization and data constraints are expressed in imperative guarded command style, instead denotational style as the coordination language Reo. To demonstrate executability property, provide translation scheme from symbolic to Promela, model checker Spin. As proof concept, Reo software defined network circuit, use Spin verify that our satisfies some temporal properties.